On Growth Rates of Permutations, Set Partitions, Ordered Graphs and Other Objects
نویسندگان
چکیده
منابع مشابه
On Growth Rates of Permutations, Set Partitions, Ordered Graphs and Other Objects
For classes O of structures on finite linear orders (permutations, ordered graphs etc.) endowed with containment order (containment of permutations, subgraph relation etc.), we investigate restrictions on the function f(n) counting objects with size n in a lower ideal in (O, ). We present a framework of edge P -colored complete graphs (C(P ), ) which includes many of these situations, and we pr...
متن کاملHereditary properties of partitions, ordered graphs and ordered hypergraphs
In this paper we use the Klazar-Marcus-Tardosmethod (see [22]) to prove that if a hereditary property of partitions P has super-exponential speed, then for every k-permutation π, P contains the partition of [2k] with parts {{i, π(i) + k} : i ∈ [k]}. We also prove a similar jump, from exponential to factorial, in the possible speeds of monotone properties of ordered graphs, and of hereditary pro...
متن کاملPartitions of a Finite Partially Ordered Set
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for short). We will define three different notions of partition of a poset, namely, monotone, regular, and open partition. For each of these notions we will find three equivalent definitions, that will be shown to be equivalent. We start by defining partitions of a poset in terms of fibres of some su...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملPattern Avoidance in Ordered Set Partitions
In this paper we consider the enumeration of ordered set partitions avoiding a permutation pattern of length 2 or 3. We provide an exact enumeration for certain special cases, and a recursive technique to exactly enumerate the appropriate set partitions in general. We also give some asymptotic results for the growth rates of the number of ordered set partitions avoiding a single pattern; includ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2008
ISSN: 1077-8926
DOI: 10.37236/799